Free subgroups of dendrite homeomorphism group
نویسندگان
چکیده
منابع مشابه
Normal Subgroups of the Free Group
We present a method of producing normal subgroups of the free group on r generators not containing a given word. Special attention is given to the normal subgroups of the free group on two generators. In considering the exponent sum of the generators in a given word, we produce such subgroups and clearly state for what class of words these subgroups are not easily obtainable. We also provide a ...
متن کاملCongruence Subgroups of the Automorphism Group of a Free Group
Let n ≥ 2 and Fn be the free group of rank n. Its automorphism group Aut(Fn) has a well-known surjective linear representation ρ : Aut(Fn) −→ Aut(Fn/F ′ n) = GLn(Z) where F ′ n denotes the commutator subgroup of Fn. By Aut (Fn) := ρ(SLn(Z)) we denote the special automorphism group of Fn. For an epimorphism π : Fn → G of Fn onto a finite group G we call Γ(G, π) := {φ ∈ Aut(Fn) | πφ = π} the stan...
متن کاملSubgroups of a Free Group and the Axiom of Choice
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...
متن کاملComputing Closures of Nitely Generated Subgroups of the Free Group
RR esum e The aim of this paper is to present computing techniques for the nitely generated subgroups of the free group. The focus is the computation of the closures of a nitely generated subgroup for certain proonite topologies, namely the prop and the pro-nilpotent topology. However the rst section concentrates on the eeective manipulation of nitely generated subgroups when more elementary op...
متن کاملRandom Generation of Finitely Generated Subgroups of a Free Group
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertices of its representation by a reduced graph such as can be obtained by the method of Stallings foldings. Our algorithm randomly generates a subgroup of a given size n, according to the uniform distribution over size n ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 2012
ISSN: 0166-8641
DOI: 10.1016/j.topol.2012.04.001